Light Functional Interpretation - an optimization of Gödel ’ s technique towards the extraction of ( more ) efficient programs from ( classical ) proofs - Technical Appendix
نویسنده
چکیده
We give a Natural Deduction formulation of an adaptation of Gödel’s functional (Dialectica) interpretation to the extraction of (more) efficient programs from (classical) proofs. We adapt Jørgensen’s formulation of pure Dialectica translation by eliminating his “Contraction Lemma” and allowing free variables in the extracted terms (which is more suitable in a Natural Deduction setting). We also adapt Berger’s uniform existential and universal quantifiers to the Dialectica-extraction context. The use of such quantifiers without computational meaning permits the identification and isolation of contraction formulas which would otherwise be redundantly included in the pure-Dialectica extracted terms. In the end we sketch the possible combination of our refinement of Gödel’s Dialectica interpretation with its adaptation to the extraction of bounds due to Kohlenbach into a light monotone functional interpretation.
منابع مشابه
Light Functional Interpretation - an optimization of Gödel’s technique towards the extraction of (more) efficient programs from (classical) proofs
We give a Natural Deduction formulation of an adaptation of Gödel’s functional (Dialectica) interpretation to the extraction of (more) efficient programs from (classical) proofs. We adapt Jørgensen’s formulation of pure Dialectica translation by eliminating his “Contraction Lemma” and allowing free variables in the extracted terms (which is more suitable in a Natural Deduction setting). We also...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملAnalysis of methods for extraction of programs from non-constructive proofs
Proofs in constructive logic correspond to functional programs in a direct and natural way. Computational content can also be found in proofs which use non-constructive principles, but more advanced techniques are required to interpret such proofs. Various methods have been developed to harvest programs from derivations in classical logic and experiments have yielded surprising and counterintui...
متن کاملQuasi-linear Dialectica Extraction
Gödel’s functional interpretation [Göd58] can be used to extract programs from non-constructive proofs. Though correct by construction, the obtained terms can be computationally inefficient. One reason for slow execution is the re-evaluation of equal subterms due to the use of substitution during the extraction process. In the present paper we define a variant of the interpretation, which avoid...
متن کاملExploring the Computational Content of the Infinite Pigeonhole Principle
The use of classical logic for some combinatorial proofs, as it is the case with Ramsey’s theorem, can be localized in the Infinite Pigeonhole (IPH) principle, stating that any infinite sequence which is finitely colored has an infinite monochromatic subsequence. Since in general there is no computable functional producing such an infinite subsequence, we consider a Π2-corollary, proving the cl...
متن کامل